Collective Strategy Condensation: When Envy Splits Societies

Human societies are characterized by three constituent features, besides others. (A) Options, as for jobs and societal positions, differ with respect to their associated monetary and non-monetary payoffs. (B) Competition leads to reduced payoffs when individuals compete for the same option as others. (C) People care about how they are doing relatively to others. The latter trait—the propensity to compare one’s own success with that of others—expresses itself as envy. It is shown that the combination of (A)–(C) leads to spontaneous class stratification. Societies of agents split endogenously into two social classes, an upper and a lower class, when envy becomes relevant. A comprehensive analysis of the Nash equilibria characterizing a basic reference game is presented. Class separation is due to the condensation of the strategies of lower-class agents, which play an identical mixed strategy. Upper-class agents do not condense, following individualist pure strategies. The model and results are size-consistent, holding for arbitrary large numbers of agents and options. Analytic results are confirmed by extensive numerical simulations. An analogy to interacting confined classical particles is discussed.     

Concurrent multiresponse non-linear screening: Robust profiling of webpage performance

Profiling engineered data with robust mining methods continues attracting attention in knowledge engineering systems. The purpose of this article is to propose a simple technique that deals with non-linear multi-factorial multi-characteristic screening suitable for knowledge discovery studies. The method is designed to proactively seek and quantify significant information content in engineered mini-datasets. This is achieved by deploying replicated fractional-factorial sampling schemes. Compiled multi-response data are converted to a single master-response effectuated by a series of distribution-free transformations and multi-compressed data fusions. The resulting amalgamated master response is deciphered by non-linear multi-factorial stealth stochastics intended for saturated schemes. The stealth properties of our method target processing datasets which might be overwhelmed by a lack of knowledge about the nature of reference distributions at play. Stealth features are triggered to overcome restrictions regarding the data normality conformance, the effect sparsity assumption and the inherent collapse of the ‘unexplainable error’ connotation in saturated arrays. The technique is showcased by profiling four ordinary controlling factors that influence webpage content performance by collecting data from a commercial browser monitoring service on a large scale web host. The examined effects are: (1) the number of Cascading Style Sheets files, (2) the number of JavaScript files, (3) the number of Image files, and (4) the Domain Name System Aliasing. The webpage performance level was screened against three popular characteristics: (1) the time to first visual, (2) the total loading time, and (3) the customer satisfaction. Our robust multi-response data mining technique is elucidated for a ten-replicate run study dictated by an L₉(3⁴) orthogonal array scheme where any uncontrolled noise embedded contribution has not been necessarily excluded.     

Synthesis and Photophysical Properties of a Sc3N@C80‐Corrole Electron Donor–Acceptor Conjugate

Embedding endohdedral metallofullerenes (EMFs) into electron donor–acceptor systems is still a challenging task owing to their limited quantities and their still largely unexplored chemical properties. In this study, we have performed a 1,3‐dipolar cycloaddition reaction of a corrole‐based precursor with Sc₃N@C₈₀ to regioselectively form a [5,6]‐adduct ( 1 ). The successful attachment of the corrole moiety was confirmed by mass spectrometry. In the electronic ground state, absorption spectra suggest sizeable electronic communications between the electron acceptor and the electron donor. Moreover, the addition pattern occurring at a [5,6]‐bond junction is firmly proven by NMR spectroscopy and electrochemical investigations performed with 1 . In the electronically excited state, which is probed in photophysical assays with 1 , a fast electron‐transfer yields the radical ion pair state consisting of the one‐electron‐reduced Sc₃N@C₈₀ and of the one‐electron‐oxidized corrole upon its exclusive photoexcitation. As such, our results shed new light on the practical work utilizing EMFs as building blocks in photovoltaics.     

Design of organophosphorus materials for organic electronics and bio-applications

π-Extended molecules are key components for the development of materials science. In fact, polyaromatic structures are fundamental for the scientific and technological progress of fields such as organic electronics and bio-applications. Beneficial properties of π-extended structures are absorption in the visible region, often luminescence, high electron mobilities and stability. Common approaches to adjust the properties of polyaromatic structures to functional setups involve changes in shape and size at the molecular level. Recently, incorporating hetero-elements emerged as successful approach. In this regard, organophosphorus conjugated molecules are new materials holding great promise for potential applications. In this review, we comprehensively discuss the design/development of polyaromatic phosphorus materials and their applicability. We establish structure/property/applicability relationships to provide key guidelines for the engineering of newer, future applications. This article thus provides a source of information for the further development of this rapidly evolving field of research.     

Recent Progress in the $L_p$ Theory for Elliptic and Parabolic Equations with Discontinuous Coefficients

In this paper, we review some results over the last 10-15 years on elliptic and parabolic equations with discontinuous coefficients. We begin with an approach given by N. V. Krylov to parabolic equations in the whole space with $\rm{VMO}_x$ coefficients. We then discuss some subsequent development including elliptic and parabolic equations with coefficients which are allowed to be merely measurable in one or two space directions, weighted $L_p$estimates with Muckenhoupt ($A_p$) weights, non-local elliptic and parabolic equations, as well as fully nonlinear elliptic and parabolic equations.     

Spectral estimates for saddle point matrices arising in weak constraint four‐dimensional variational data assimilation

We consider the large sparse symmetric linear systems of equations that arise in the solution of weak constraint four‐dimensional variational data assimilation, a method of high interest for numerical weather prediction. These systems can be written as saddle point systems with a 3 × 3 block structure but block eliminations can be performed to reduce them to saddle point systems with a 2 × 2 block structure, or further to symmetric positive definite systems. In this article, we analyse how sensitive the spectra of these matrices are to the number of observations of the underlying dynamical system. We also obtain bounds on the eigenvalues of the matrices. Numerical experiments are used to confirm the theoretical analysis and bounds.     

Approximate inverse computation using Frobenius inner product

Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, min_M∈??∥AM?I∥ _F and matrix M₀∈?? corresponding to this minimum (?? being any vectorial subspace of ??_n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd.